Random Graph-Homomorphisms and Logarithmic Degree
نویسندگان
چکیده
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the infinite line Z. It is shown that if the maximal degree of G is ‘sub-logarithmic’, then the range of such a homomorphism is super-constant. Furthermore, some examples are provided, suggesting that perhaps for graphs with superlogarithmic degree, the range of a typical homomorphism is bounded. In particular, a sharp transition is shown for a specific family of graphs Cn,k (which is the tensor product of the n-cycle and a complete graph, with self-loops, of size k). That is, given any function ψ(n) tending to infinity, the range of a typical homomorphism of Cn,k is super-constant for k = 2 log(n)− ψ(n), and is 3 for k = 2 log(n) + ψ(n).
منابع مشابه
The complexity of counting graph homomorphisms
The problem of counting homomorphisms from a general graph G to a fixed graph H is a natural generalisation of graph colouring, with important applications in statistical physics. The problem of deciding whether any homomorphism exists was considered by Hell and Nešetřil. They showed that decision is NPcomplete unless H has a loop or is bipartite; otherwise it is in P. We consider the problem o...
متن کاملLocally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent characterizations of degree matrices. As a consequence we can efficiently check whether a given matrix M is a degree matrix of some graph and also compute the size of a smallest graph for which it is a degree matrix in polyno...
متن کاملUpper Bounds on the Height Diierence of the Gaussian Random Field and the Range of Random Graph Homomorphisms into Z
Bounds on the range of random graph homomorphism into Z, and the maximal height diierence of the Gaussian random eld, are presented.
متن کاملComponent Evolution in Random Intersection Graphs
We study the evolution of the order of the largest component in the random intersection graph model which reflects some clustering properties of real–world networks. We show that for appropriate choice of the parameters random intersection graphs differ from Gn,p in that neither the so-called giant component, appearing when the expected vertex degree gets larger than one, has linear order nor i...
متن کاملFixed point approach to the Hyers-Ulam-Rassias approximation of homomorphisms and derivations on Non-Archimedean random Lie $C^*$-algebras
In this paper, using fixed point method, we prove the generalized Hyers-Ulam stability of random homomorphisms in random $C^*$-algebras and random Lie $C^*$-algebras and of derivations on Non-Archimedean random C$^*$-algebras and Non-Archimedean random Lie C$^*$-algebras for the following $m$-variable additive functional equation: $$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...
متن کامل